Method and apparatus for identifying, authenticating, tracking and tracing manufactured items

ABSTRACT

A method and apparatus for identifying manufactured items in containers, where each container is suitable for containing two or more units, and where the method comprises the steps of: associating each unit with a unique unit identifier, uniquely identifying each unit, allocating two or more units to be contained in each container, uniquely identifying each container, for each container, determining one or more ranges of unit identifiers of the two or more units allocated to the container, and storing, in a database, a container identifier for each container, each container identifier being coupled, in the database, to the one or more ranges of unit identifiers of the two or more units allocated to the container. There is also provided methods and apparatus for authenticating, tracking and tracing the units.

CROSS REFERENCE TO RELATED APPLICATIONS

This application is a Continuation of U.S. patent application Ser. No.15/617,858, filed Jun. 8, 2017, which is a Continuation of U.S. patentapplication Ser. No. 12/405,791, filed Mar. 17, 2009, which claimspriority to European Application No. 08250926.6, filed Mar. 17, 2008,the entire contents of each of which are incorporated herein byreference.

BACKGROUND OF THE DISCLOSURE

The present invention relates to methods and apparatus for identifying,authenticating, tracking and tracing manufactured items. In particular,the present invention relates to methods and apparatus for identifyingmanufactured items in containers, each container suitable for containingtwo or more units, and methods and apparatus for authenticating,tracking and tracing those units.

Contraband and counterfeiting cause significant loss of revenue toproducers of traded goods and to national authorities. Moreover, theillegal sale of counterfeited goods of inferior quality is detrimentalto the customer and to the manufacturer. Legally produced goods may alsobe illegally imported or traded, for example in order to evade taxes ornational regulations. Also, this is particularly important for otherproducts, such as pharmaceuticals. In addition, regulations areincreasingly being introduced to require manufacturers and distributorsto be able to track such goods as they move through a global market.

The problems of contraband and counterfeiting are particularly acute forgoods subject to special taxation, for example tobacco products. Theproblems also exist for many other kinds of traded products carrying astrong brand value, in particular for internationally traded products,such as perfumes, alcohols, watches and luxury goods in general. So,manufacturers, customers, distributors, importers, national authoritiesand other authorized parties need to be able to verify easily thatparticular goods are genuine and to be able to track goods easily asthey are transported.

Many internationally traded products, including tobacco products, areshipped worldwide in shipping cases. Each shipping case typicallycontains a number of smaller cartons. Each carton may contain one ormore individual products or packs of products. For example, for tobaccoproducts, each shipping case may contain 50 cartons, and each carton maycontain 10 packs, and each pack may contain 20 smoking articles.

Shipping cases are usually labelled with an identification code. Forexample, U.S. 2008/0046263 (or WO 2006/038114), the contents of which isincorporated herein by this reference thereto, describes a method andapparatus for marking and authenticating manufactured items, in whichthe identification codes of cartons do not need to be centrally stored.Such an identification code may provide information regardingproduction, and can be used to track the shipping case as it istransported, and to authenticate the products contained within theshipping case.

In one previously proposed method, each carton packed within a shippingcase is identified using a carton identifier. Each shipping case isidentified using a shipping case identifier. A central database storeseach carton identifier and each shipping case identifier. In thedatabase, each carton identifier is linked to the associated shippingcase identifier and each shipping case identifier is linked to theassociated carton identifiers. Such a known system may be implemented atthe production line. Each carton is applied with a carton identifier(either directly, or onto packaging or a label). As each carton exitsthe production line, the carton identifier is read. Each cartonidentifier is sent to a database stored on a central server. Then, aplurality of cartons is packed into a shipping case. Each shipping caseis applied with a shipping case identifying label having a shipping caseidentifier. As each shipping case leaves the production line, theshipping case identifier is read and sent to the database. Theproduction line monitors which cartons are packed into which shippingcase, and the database can then link a shipping case identifier to theplurality of carton identifiers of the cartons packed in the shippingcase. Thus, for each carton, the associated shipping case can beidentified and, for each shipping case, the associated cartons can beidentified. This allows individual cartons to be tracked and identifiedvia the carton and the shipping case identification codes.

BRIEF SUMMARY OF SOME ASPECTS OF THE DISCLOSURE

There exists a need for an improved method and apparatus foridentifying, authenticating, tracking and tracing manufactured items.

According to a first aspect of the invention there is provided a methodfor identifying manufactured items in containers, each containersuitable for containing two or more units, the method comprising thesteps of: associating each unit with a unique unit identifier; uniquelyidentifying each unit; allocating two or more units to be contained ineach container; uniquely identifying each container; for each container,determining one or more ranges of unit identifiers of the two or moreunits allocated to the container; and storing, in a database, acontainer identifier for each container, each container identifier beingcoupled, in the database, to the one or more ranges of unit identifiersof the two or more units allocated to the container.

In the context of this invention, the term “identifying” is used to meanthe classifying or categorizing of containers, units or items, forexample at the production line. The identifying is carried out in orderto distinguish one container, unit or item from another and to allowsubsequent authentication, tracking or tracing. The term“authenticating” is used to mean the checking that a particular unit orcontainer is authentic, that is, it has originated from a genuinesource, and is not a counterfeit product. The term “tracking” is used tomean the monitoring of movement, location and time as the units andcontainers are transported and stored. This is particularly usefulduring the delivery process when units and containers may be passingthrough various shippers, delivery companies, importers and distributorson their way to customers. The term “tracing” is used to mean thelocating of selected units or containers, for example for productrecall.

The method of the invention allows individual units to be identified andtracked. This means that, even if illegal importers divide and mix thecontents of containers, the items can still be tracked. Because eachcontainer identifier is linked only to ranges of unit identifiers forthe units it contains, rather than to all the individual units' unitidentifiers, the storage required in the database is smaller than inknown systems. In prior art systems, a large number of cartonidentification codes must be stored for each shipping case. In the caseof tobacco products, in which each shipping case typically contains 50cartons, that requires 50 carton identification codes to be stored foreach shipping case. The method of the invention allows the required datastorage to be substantially reduced. In addition, it is unlikely thatsuch prior art systems could be used for identification of each packwithin a carton, as this would require even more storage: 10 packidentification codes for each carton, in addition to the carton andshipping case identification codes already stored. The method of theinvention allows this, because the data storage requirements arereduced. Thirdly, in prior art systems, for authenticating the cartons,the actual carton identification code must be transmitted across anetwork, which may not be particularly secure. In the method of theinvention, the actual carton identification code does not need to betransmitted.

Each unit may be an individual manufactured item. Alternatively, eachunit may be a smaller container for manufactured items.

In one embodiment, each unit identifier comprises production detailsassociated with the respective unit. In an alternative embodiment, eachunit identifier is an encrypted version of production details associatedwith the respective unit. In that embodiment, preferably the identifieritself is not stored; preferably, only the production details and anencryption key used for the encryption are stored.

Preferably, the production details for each unit comprise one or moreof: production location, production date, production time, and a countervalue of an incremental counter.

The production details are unique to each unit. In order to achievethis, in one embodiment, the production details comprise only thecounter value of the incremental counter. In an alternative embodiment,the production details comprise only the production time. However, in apreferred embodiment, the production details comprise the productionlocation, the production date, the production time and the counter valueof the incremental counter. In that embodiment, the incremental countermay be reset each time period.

The production location may comprise one or both of the productioncenter and the specific production line, or the Code GeneratorIdentification. The Code Generator Identification is an identifieruniquely identifying the point where the unit identifier isgenerated—see, for example, US 2008/0046263. The production time may bespecified as accurately as desired and this will probably depend on thespeed of production of the units. For example, the production time maybe specified in terms of hours only. Alternatively, the production timemay be specified in terms of hours and minutes. Alternatively, theproduction time may be specified in terms of hours, minutes and seconds.

The step of uniquely identifying each unit may comprise marking eachunit with the unit identifier. Alternatively, the unit may be uniquelyidentified based on the unit's intrinsic properties, for examplephysical or chemical properties. The step of uniquely identifying eachcontainer may comprise marking each container with a containeridentifier. Alternatively, the container may be uniquely identifiedbased on the container's intrinsic properties, for example physical orchemical properties.

The method may be incorporated into the production process for units andcontainers. The step of allocating two or more units to be contained ineach container may comprise packing two or more units in a container.

In one exemplary embodiment, the container is a shipping case fortobacco products. In that embodiment, preferably, the unit is a cartonfor tobacco products. Each shipping case may be arranged to hold 50cartons. Each carton may be arranged to hold 10 packs of smokingarticles. Each pack may be arranged to hold 20 smoking articles.Preferably, each unit identifier is a 12-digit alphanumeric code, whichis an encrypted version of the unit's production details. Preferably,each container identifier is a 40-digit number.

According to the first aspect of the invention there is also provided amethod for identifying cartons of smoking articles in shipping cases,each shipping case suitable for containing 50 cartons, the methodcomprising the steps of: associating each carton with a unique cartonidentifier; uniquely identifying each carton; allocating 50 cartons tobe contained in each shipping case; uniquely identifying each shippingcase; for each shipping case, determining one or more ranges of cartonidentifiers of the 50 cartons allocated to the shipping case; andstoring, in a database, a shipping case identifier for each shippingcase, each shipping case identifier being coupled, in the database, tothe one or more ranges of carton identifiers of the 50 cartons allocatedto the shipping case.

According to a second aspect of the invention, there is provided amethod for tracking a unit contained or formerly contained within acontainer for manufactured items identified according to the method ofthe first aspect of the invention, the method comprising the steps of:reading a unit identifier on the unit; and sending details of the unitidentifier to a host including the database.

Preferably, the host is arranged to store the location of the unitdetermined from the reading of the unit identifier. Preferably, the hostis arranged to store at least one previous location of the unitdetermined from at least one previous reading of the unit identifier.This is advantageous because the individual units can be tracked fromlocation to location, using the unit identifiers. The host may also bearranged to store details of the movement of the unit, for example theroute taken by the unit between locations, the time the unit was to befound at a particular location, and other details useful for tracking.

Preferably, the method further comprises the step of receiving, from thehost, details of the at least one previous location of the unit. Themethod may further comprise the step of receiving, from the host,details of the movement of the unit.

Preferably, the host is arranged to determine, from the received unitidentifier, the range in which falls the unit identifier of the unitand, hence, the container containing or formerly containing the unit,and preferably the host is arranged to store at least one location ofthe container containing or formerly containing the unit. The host mayalso be arranged to store details of the movement of the containercontaining or formerly containing the unit, for example the route takenby the container between locations, the time the container was to befound at a particular location, and other details useful for tracking.

Preferably, the method further comprises the step of receiving, from thehost, details of the at least one location of the container containingor formerly containing the unit. The method may further comprise thestep of receiving, from the host, details of the movement of thecontainer containing or formerly containing the unit.

According to the second aspect of the invention, there is also provideda method for tracking a container for manufactured items identifiedaccording to the method of the first aspect of the invention, the methodcomprising the steps of: reading a container identifier on thecontainer; and sending details of the container identifier to a hostincluding the database.

According to a third aspect of the invention, there is provided a methodfor authenticating a unit contained or formerly contained within acontainer for manufactured items identified according to the method ofthe first aspect of the invention, the method comprising the steps of:reading a unit identifier on the unit; and sending details of the unitidentifier to a host including the database.

Preferably, the host is arranged to determine, from the received unitidentifier, the range in which falls the unit identifier of the unitand, hence, the container containing or formerly containing the unit.This is advantageous because the individual units can be authenticated,using the unit identifiers, as originating from a genuine container. Ifthe unit identifier cannot be recognized or cannot be matched to acontainer, there may be a supposition that the unit is not genuine.

Preferably, the method further comprises the step of receiving from thehost, confirmation that the unit is authentic. The confirmation mayinclude an indication of the container containing or formerly containingthe unit.

According to the third aspect of the invention, there is also provided amethod for authenticating a container for manufactured items identifiedaccording to the method of the first aspect of the invention, the methodcomprising the steps of: reading a container identifier on thecontainer; and sending details of the container identifier to a hostincluded in the database.

According to a fourth aspect of the invention, there is provided amethod for tracing units contained within a container for manufactureditems identified according to the method of the first aspect of theinvention, the method comprising the steps of: determining the unitidentifiers of the units to be traced; determining, from those unitidentifiers, the one or more ranges of unit identifiers in which fallthose unit identifiers; determining, from those ranges, the container orcontainers containing the units to be traced; and locating thedetermined container or containers.

The step of locating the determined container or containers may comprisereading, from a database, delivery and destination details for thecontainer or containers.

According to the first aspect of the invention, there is also providedapparatus for identifying manufactured items in containers, eachcontainer suitable for containing two or more units, each unit beingassociated with a unique unit identifier, the apparatus comprising:means for uniquely identifying each unit; means for allocating two ormore units to be contained in each container; means for uniquelyidentifying each container; means for determining one or more ranges ofunit identifiers of the two or more units allocated to the container;and a database for storing a container identifier for each container,each container identifier being coupled, in the database, to the one ormore ranges of unit identifiers of the two or more units allocated tothe container.

Because each container identifier is linked only to ranges of unitidentifiers for units it contains, rather than to all the individualunits' identifiers, the data storage requirements are smaller than inknown systems.

In one embodiment, each unit identifier comprises production detailsassociated with the respective unit. In an alternative embodiment, eachunit identifier is an encrypted version of production details associatedwith the respective unit. In that embodiment, preferably the identifieritself is not stored; preferably, only the production details and anencryption key used for the encryption are stored.

Preferably, the production details for each unit comprise one or moreof: production location, production date, production time, and a countervalue of an incremental counter. The production details are unique toeach unit. In order to achieve this, in one embodiment, the productiondetails comprise only the counter value of the incremental counter. Inan alternative embodiment, the production details comprise only theproduction time. However, in a preferred embodiment, the productiondetails comprise the production location, the production date, theproduction time and the counter value of the incremental counter. Inthat embodiment, the incremental counter may be reset each time period.

The means for uniquely identifying each unit may comprise means formarking each unit with the unit identifier. The means for uniquelyidentifying each container may comprise means for marking each containerwith the container identifier.

The apparatus may be incorporated into the production apparatus forunits and containers. The means for allocating two or more units to becontained in each container may comprise means for packing two or moreunits in a container.

According to the first aspect of the invention, there is also providedapparatus for identifying cartons of smoking articles in shipping cases,each shipping case suitable for containing 50 cartons, each carton beingassociated with a unique carton identifier, the apparatus comprising:means for uniquely identifying each carton; means for allocating 50cartons to be contained in each shipping case; means for uniquelyidentifying each shipping case; means for determining one or more rangesof carton identifiers of the 50 cartons allocated to the shipping case;and a database for storing a shipping case identifier for each shippingcase, each shipping case identifier being coupled, in the database, tothe one or more ranges of carton identifiers of the 50 cartons allocatedto the shipping case.

According to the second aspect of the invention, there is also providedapparatus for tracking and authenticating a unit contained or formerlycontained within a container for manufactured items identified accordingto the method of the first aspect of the invention, the apparatuscomprising: a reader for reading a unit identifier on the unit; and atransmitter for sending details of the unit identifier to a hostincluding the database.

Preferably, the apparatus further comprises a receiver for receivingmessages from the host.

According to the invention, there is also provided a container formanufactured items identified according to the method of the firstaspect of the invention. According to the invention, there is alsoprovided a container identifier for such a container. According to theinvention, there is also provided a unit contained or formerly containedwithin a container for manufactured items identified according to themethod of the first aspect of the invention. According to the invention,there is also provided a unit identifier for such a unit.

Features described in relation to one aspect of the invention may alsobe applicable to another aspect of the invention.

BRIEF DESCRIPTION OF THE DRAWINGS

The invention will be further described, by way of example only, withreference to FIGS. 1 to 5, wherein like reference numerals are appliedto like elements and wherein:

FIG. 1 is a schematic view shows a shipping case having an identifyinglabel including a shipping case identifier;

FIG. 2 schematically shows an embodiment of the method of the invention,for applying carton identifiers and shipping case identifiers at theproduction line;

FIG. 3 schematically shows a first example of carton production in whichthe invention may be implemented;

FIG. 4 schematically shows a second example of carton production inwhich the invention may be implemented; and

FIG. 5 schematically shows a third example of carton production in whichthe invention may be implemented.

DETAILED DESCRIPTION

FIG. 1 shows a shipping case 103 having an identifying label 105. Eachshipping case 103 is suitable for containing two or more cartons 101.Each carton has a carton identifier 101 a. In this exemplary embodiment,the shipping case identifying label 105 comprises two portions: amachine-readable shipping case identifier 107 and a human-readableshipping case identifier 109.

In this embodiment, the human-readable shipping case identifier 109 is a40 digit number. The 40 digit number is encoded into an EAN-128 (alsoknown as GS1-128) barcode which forms the machine-readable shipping caseidentifier 107. The identifier 109, and hence the identifier 107, areunique for each particular shipping case 103. In this embodiment, theidentifiers 107 and 109 typically identify information including, butnot limited to, the production date (YYMMDD), the production time(HHMMSS), the production center, and the case packer number. Thecustomer recipient of the shipping case may also be identified ifalready known. Since the identifiers 107 and 109 identify the sameinformation, but simply have a different form, they will be referred togenerically as shipping case identifier 103 a.

As discussed above, the shipping case identifying label can be used fortracking the shipping case. For example, a customer order may be linkedto the identifying label or labels of the particular shipping case orcases containing the ordered goods. This allows the customer, themanufacturer and any intermediaries to constantly track the location ofthe required goods. This may be achieved using scanners for scanning theidentifiers 103 a and communicating with a central database.Alternatively, the identifiers can be read by a human, who can thenmanually communicate with a central database.

The shipping case identifying label may also be used by customers,national authorities and other parties, to verify that a particularshipping case contains genuine articles. For example, a party may use ascanner to read the identifier 103 a on a shipping case (or theidentifier can be read by a human, as discussed above). The identifierdetails may be sent to the central database. The central database canthen lookup the identifier details, determine the shipping caseproduction details and send those details to the scanner, therebyallowing the party to verify the shipping case, and the productscontained therein, as genuine. In the event that the central databasedoes not recognize the identifier, the party may suppose that thearticles in question are counterfeit.

The shipping case identifying label may also be used for tracingshipping cases. For example, if the manufacturer needs to recall theproducts from a selected number of shipping cases, those shipping casescan be traced using their identifying labels.

As discussed previously, a method has already been proposed to link theshipping case identifier to the cartons contained within the shippingcase. In that method, each carton identifier may be a 12-digitalphanumeric code. On the carton itself, the 12-digit alphanumeric codemay be coded into a 2D barcode in the form of a datamatrix. The 12-digitcode may also be printed onto the carton. As already mentioned, eachshipping case identifier may a 40-digit number.

Thus, for that system, data storage in the database might be as shown inTable 1.

TABLE 1 CARTON IDENTIFIER 101a SHIPPING CASE IDENTIFIER 103aL73Q2M5JQC47 0107623900507450200411071123100215222123 7S6UAJBL3U620107623900507450200411071123100215222123 4XJLKTND82CH0107623900507450200411071123100215222123 CSY6KVHK4MTC0107623900507450200411071123100215222123 C6SY9V53CXB60107623900507450200411071123100215222123 HVD31USQ0U0V0107623900507450200411071123100215222123 DBJ2UBX5RWCC0107623900507450200411071123100215222123 ELQU4CJNAL570107623900507450200411071123100215222123 PWA2E2TZYCWK0107623900507450200411071123100215222123 9UB9ASGG20F60107623900507450200411071123100215222123 U26V5VKG8WCH0107623900507450200411071123100215222123 . . . . . .

Thus, each carton identifier 101 a (in this case a 12-digit alphanumericcode) is linked to the identifier 103 a of the shipping case (in thiscase a 40-digit number) to which it is allocated. Each shipping caseidentifier 103 a is, in turn, linked to the carton identifiers 101 a ofall the cartons contained in the shipping case.

Consider the above described example used for tobacco products. In thiscase, each shipping case 103 contains 50 cartons 101. Each shipping case103 has an identifier 103 a which comprises a 40 digit code. In oneexample, because of repetition of certain digits and redundancy ofcertain digits (at least for this purpose), this can be compacted into 8bytes of storage. Each carton 101 has an identifier 101 a whichcomprises a 12-digit alphanumeric code. Each alphanumeric digit requires1 byte of storage. So each, carton identifier 101 a requires 12 bytes ofstorage. Thus, each shipping case requires 50×(12+8)=1000 bytes≈1kilobyte of storage (since the 40 digit code is stored for everyalphanumeric code). Given the huge numbers of smoking articles producedworldwide, the database size required will be enormous.

In the present invention, the required data storage is considerablyreduced.

In an embodiment, each carton identifier is an encrypted version of thefollowing information: the code generator ID that generates the code,the production date and time, and an incremental counter reset at thestart of each minute (see, for example, U.S. 2008/0046263, alreadymentioned). That is, in this embodiment, each carton identifier is anencrypted version of production details of the respective carton. Thus,the carton identifier information might be as shown in Table 2.

TABLE 2 CODE CARTON GENERATOR PRODUCTION IDENTIFIER ID DATE & TIMECOUNTER . . . . . . . . . . . . L73Q2M5JQC47 116 23/11/2007 10:11 867S6UAJBL3U62 116 23/11/2007 10:11 87 4XJLKTND82CH 116 23/11/2007 10:1188 CSY6KVHK4MTC 116 23/11/2007 10:11 89 C6SY9V53CXB6 116 23/11/200710:11 90 HVD31USQ0U0V 116 23/11/2007 10:12  1 DBJ2UBX5RWCC 11623/11/2007 10:12  2 ELQU4CJNAL57 116 23/11/2007 10:12  3 PWA2E2TZYCWK116 23/11/2007 10:12  4 9UB9ASGG20F6 116 23/11/2007 10:12  5U26V5VKG8WCH 116 23/11/2007 10:12  6 . . . . . . . . . . . .

The carton identifier may be, as discussed in U.S. 2008/0046263, aunique identification code SUPI obtained by processing data in aProduction Information Code PIC. The PIC combines various data relatedto the manufacture of the item, such as a code MC identifying amanufacturing centre, a code PL identifying a particular production linewithin a manufacturing centre, and codes YR, DY, HR identifying theyear, day and hour, respectively, when a particular item wasmanufactured. In one alternative embodiment, the PIC may include a codegenerator ID instead of the manufacturing centre and production linecodes MC, PL.

To obtain the PIC, the individual data elements can be combined bydecimal or binary digit juxtaposition, by algebraic composition, byapplying a predefined shift value each data element and adding all theshifted values together, or by any other computational means. Preferablythe composition function is invertible, to allow decomposition of thePIC into the original elements MC, PL, YR, DY, I-IR. In the case of anon-reversible composition function, an additional element may beintroduced into the PIC to ensure uniqueness.

During each production hour, a production line fabricates a large numberof items. Each item is identified, within a production hour, by anindividual number TI, for example a progressive number corresponding tothe chronological production sequence. Other manners of generating orassigning individual numbers are possible.

The production information code PIC and the individual number TI arecombined to provide an item identifier UPI. In the followingdescription, each UPI is unique to an item, for example to a singlecigarette pack or cigarette carton. However the invention is not limitedto this case, and includes variants with non-unique UPI numbers,distinguishable from each other by their different digital signatures.

In more detail, at each production line at the beginning of eachproduction batch, the code generator generates a random salt indexalpha, which is transmitted to a checking centre, with variousinformation related to the item to be manufactured such as, for example,brand, intended market of destination, packaging. A new salt index alphais generated at every change of production batch. Preferably thechecking centre acknowledges successful receipt of the index alpha tothe code generator. The index alpha may be regarded as a dynamic secretcode.

In an embodiment, the UPI code of the first item to be produced in thebatch is transmitted with the index alpha to the checking centre. Thesalt index alpha is stored in a database related to various informationabout the item to be manufactured. This enables the checking centre,upon receipt of a request to check a particular SUPI code, to retrievethe particular alpha and knowing the salt matrix used by the codegenerator to sign that SUPI code, validate the signature.

The random salt index alpha, the salt matrix and the UPI code are usedby the code generator for generating a noise code, which is safe fromcryptographic attacks. It does not allow the reconstruction of theoriginal values of alpha, salts matrix and UPI. A variety of knowntechniques are available for generating the noise code including, butnot limited to, table substitution, indexing, hashing, and variationsthereof. The noise code so generated is unequivocally calculated fromthe UPI, yet the inverse operation is computationally impossible.

The noise code is used as a digital signature, allowing validation ofthe UPI code. Preferably the alpha code and the salt matrix are combinedin a different way for each manufactured item, in order to render thedigital signatures robust against decryption attempts.

The salt matrix and the alpha code are known only by the code generatorand by the checking centre. Together they constitute a secret allowingthe code generator to generate signed codes which the checking centrecan subsequently verify.

The UPI number and the calculated noise code are combined and,preferably, the resulting code is obfuscated, destroying correlationsbetween successive codes. The obfuscation operation is reversible,allowing the checking centre to retrieve the original UPI and noisevalue. Several known obfuscation techniques are possible. The particularobfuscation algorithm chosen is preferably not published.

The result of the obfuscation is the unique SUPI code or item (carton)identifier, which is printable on a manufactured item.

Note that Table 2 shows the connection between the encrypted cartonidentifier and the production details. Since, in this embodiment, thecarton identifier is the production details, in encrypted form, there isno need to store both the carton identifier and the production details,as long as the key used for encryption is known (see, for example, U.S.2008/0046263, already mentioned). Thus, Table 2 does not represent whatis actually stored in the database.

Because of the counter, the production details for each carton areunique, even if several cartons are produced each minute.

Each carton is then allocated to a shipping case. Depending on whichcartons are allocated to a shipping case, ranges of the productiondetails of the cartons allocated are defined. For example, if the 11cartons identified in Table 2 are all allocated to a single shippingcase, two ranges are defined. The first range will be cartons producedon date 23/11/2007, at time 10:11 on the Code Generator 116, havingCounters 86 to 90. This will cover the first five cartons. The secondrange will be cartons produced on date 23/11/2007, at time 10:12 on theCode Generator 116, having Counters 1 to 6. This will cover the finalsix cartons. Thus, for a shipping case containing these eleven cartons,only two ranges would need to be stored, as shown in Table 3.

TABLE 3 CODE PRODUC- SHIPPING GENE- TION CASE RATOR DATE & FROM TOIDENTIFIER ID TIME COUNTER COUNTER 010 . . . 123 116 23/11/2007 10:11 8690 010 . . . 123 116 23/11/2007 10:12  1  6

Because the production details for each carton are unique, each rangedefines a precise range of cartons. In this case, the production detailsare unique because, for cartons produced within the same minute, theincremental counter is different, and the incremental counter is reseteach minute.

As will be discussed further below, on average a shipping case willcontain two ranges of cartons, if the production details and ranges aresuitably defined. As before, each shipping case identifier requires 8bytes of storage (in one embodiment in which certain digits are repeatedor redundant). The production date and time requires 2 bytes of storage,the Code Generator ID requires 4 bytes of storage, the From Counterrequires 1 byte of storage and the To Counter requires 1 byte ofstorage. Thus, each range requires 8 bytes of storage. Thus, eachshipping case on average requires 2×(8+8)=32 bytes of storage. Comparedto the previous system, this has reduced the storage required from 1000bytes to 32 bytes: a vast reduction.

FIG. 2 shows an exemplary method for implementing this embodiment of theinvention at the production line. Each carton 101 is applied with acarton identifier 101 a (either directly or onto packaging or a label).As each carton 101 exits the production line 201, the carton identifier101 a is read. Each identifier 101 a (or more likely the productiondetails associated therewith) is sent to a database 203 stored oncentral server 205.

Then, a plurality of cartons 101 are packed into a shipping case 103.Each shipping case 103 is applied with a shipping case identifier 103 a.As each shipping case leaves the production line, the identifier 103 ais read and sent to the database 203. The production line monitors whichcartons are allocated to which shipping case. Once the cartonsassociated with the shipping case have been established, one or moreranges of production details can be stored for that shipping case. Thatis, at 207, for each shipping case identifier, the ranges are identifiedand stored. Thus, in the database, a shipping case identifier 103 a islinked to the appropriate range or ranges of the production details ofthe cartons packed in the shipping case. The number of ranges requiredin certain circumstances, will be discussed further below.

Once the shipping cases and cartons have been identified as describedwith reference to FIG. 2, individual cartons can be authenticated,tracked and traced as will now be described.

A customer, distributor, national authority or other authorized partycan read the identifier on a carton 101. This carton identifier 101 acan then be sent to the central database 203. From the database, theassociated shipping case can be identified. This can be used toauthenticate that the carton is genuine and has indeed originated from agenuine source and was originally packed into a genuine shipping case.Of course, if the carton identifier is not recognizable, or if it cannotbe linked to a shipping case, the supposition may be that the carton iscounterfeit. In addition, for tracking purposes, the location of thecarton can be stored when the carton identifier is sent to the database203 and this data can be used to track the movement of the carton, forexample, the route taken by the carton. That information can also beused for tracing individual cartons, for example for product recall.

Three examples of particular circumstances, in which the invention maybe applied, will now be described.

Example 1

Example 1, illustrated schematically in FIG. 3, is an example in whichindividual cartons exiting the production line are packed into ashipping case in the same order in which the carton identifiers wereapplied. Carton identifiers are applied at 301 and read at 303.

Within the context of this example, the case when 50 cartons are packedinto a shipping case is now discussed. If at least 50 cartons areproduced each minute (i.e. there are at least 50 counter values for eachminute of production), each shipping case will only need to be linked to1 or 2 ranges. If all the cartons in the shipping case are produced inthe same time period, the shipping case will be linked to only a singlerange of production details. If the cartons are produced across two timeperiods, two ranges will be required in this example. If fewer cartonsare produced each time period, of course more ranges will be required,requiring more storage. Thus, the precision of the time period can bechosen depending on the rate of production, to minimize the storagerequired.

Referring to the storage requirements discussed above, if each shippingcase references a single range, this will only require 16 bytes ofstorage. Even if each shipping case reference two ranges, this will onlyrequire 32 bytes of storage. This is a vast improvement on storagerequirements in the prior art.

Example 2

Example 2, illustrated schematically in FIG. 4, is an example in whichthe cartons exiting the production line are mixed up before being packedinto a shipping case. Carton identifiers are applied at 401 and read at403. The cartons are mixed at 405. This means that cartons havingconsecutive carton identifiers are not packed into the shipping caseconsecutively. This is a realistic example, since individual cartons maywell be removed for quality checks, and buffers, which reorder thecartons, may be provided between production lines and packing or betweenstages in the production line.

Within the context of this example, the case when 50 cartons are packedinto a shipping case is now discussed. In many situations, no change tothe ranges will be required. For example, for four cartons 1, 2, 3 and4, if cartons 2 and 3 are swapped, the original range will still bevalid, because cartons 1 to 4 will still all be included in the shippingcase. However, if cartons are removed completely, or the cartons aremixed up more substantially, a new range may need to be started. In theworst case scenario, that is, with maximum mixing, each shipping casewill need to reference 50 ranges. This corresponds to each carton in theshipping case falling within a separate range (that is, a separateminute of production or non-consecutive counter values within the sameminute). However, less mixing is likely and the shipping case may thenreference a small number (but greater than one) of ranges.

Referring to the storage requirements discussed above, even if eachshipping case references 50 ranges, this will still only require50×(8+8)=800 bytes of storage. This is less than the 1000 bytes requiredin the prior art. And, in most circumstances, the number of rangesrequired will be less than 800 bytes.

Example 3

Example 3, illustrated schematically in FIG. 5, is an example in which ashipping case contains cartons from two separate production lines, A andB. Carton identifiers are applied at 501A and 501B, for production linesA and B respectively, and read at 503. Without any mixing, this willrequire the shipping case to reference at least two ranges: one fromproduction line A and one from production line B. Even with maximummixing, the shipping case will only need to reference a maximum of 50ranges as in Example 2.

Referring to the storage requirements discussed above, if the shippingcase references a range from Production Line A and a range fromProduction Line B, this will require 32 bytes of storage. On the otherhand, if the shipping case reference 50 ranges, some from ProductionLine A and some from Production Line B, this will required 800 bytes ofstorage, still less than prior art requirements. In practice, the amountof storage will be somewhere between these two values.

In the above description, examples have been used in which each shippingcase contains 50 cartons, but the shipping case could contain any numberof cartons. The unique identifiers—in the described examples, productiondetails—can be defined appropriately depending on the number of cartonsto be packed in each shipping case and the rate of production, so as tominimize data storage requirements. The principle could also be appliedto cartons and packs, rather than shipping cases and cartons. Theprinciple could also be applied to pallets and shipping cases. In fact,the principle may be applied where any items are stored in or oncontainers, each of which contains more than one item or smallercontainers of items.

The invention provides a number of advantages. Firstly, as alreadydiscussed, the amount of data storage required is considerably smallerthan the data storage required in prior art systems. Secondly, thereduced data storage requirements mean that the system of the inventioncould easily be applied to identification of smaller items, for exampleeach pack of smoking articles within a carton or even each smokingarticle within a pack, without excessive storage requirements. Finally,the carton identifier only needs to be transmitted through a networkwhen it is being checked. At all other times, only the range or the keyof the encrypted range, needs to be transmitted, and not the cartonidentifier itself. This means that the system is potentially moresecure.

1. (canceled)
 2. A method for facilitating authentication ofmanufactured items allocated to containers for shipping, each of thecontainers for shipping being assigned a container identifier from amonga plurality of container identifiers, and each container identifierbeing a first code, the method comprising: generating, by at least oneprocessor, a plurality of unit identifiers, each of the plurality ofunit identifiers being a second code that (i) corresponds to arespective manufactured item among a plurality of manufactured itemsproduced on a respective production line during a respective timeperiod, and (ii) is an encrypted version of first production detailsassociated with the respective manufactured item, the first productiondetails including a production information code and a counter value, thecounter value indicative of a production run of the respectiveproduction line, wherein the second code corresponding to the respectivemanufactured item is generated by combining the production informationcode and the counter value to obtain an item identifier for therespective manufactured item, combining the item identifier with a noisecode to obtain a resulting code, the noise code being based on a dynamicsecret code and a static code matrix, and obfuscating the resulting codeto obtain the second code corresponding to the respective manufactureditem; marking each of the plurality of manufactured items with acorresponding one of the plurality of unit identifiers; storing shippinginformation in a memory device, the shipping information being linkedwith a production range of manufactured items stored in a container, andthe shipping information including (i) the first code for the container,(ii) first production details common to manufactured items within theproduction range of manufactured items, and (iii) unique productiondetails from among the first production details associated with firstand second manufactured items within the production range ofmanufactured items, wherein the shipping information is linked with theproduction range of manufactured items using only the unique productiondetails from among the first production details associated with thefirst and second manufactured items, the production range ofmanufactured items includes manufactured items having non-sequentialfirst production details, and a memory requirement for storing theshipping information is smaller than a memory requirement based onstoring the first code for the container and the second code for eachmanufactured item stored in the container.
 3. The method of claim 2,further comprising: receiving, over a communication network, secondproduction details for a third manufactured item stored in a remotecontainer, the second production details for the third manufactured itemextracted from a unit identifier of the third manufactured item; andauthenticating the third manufactured item by comparing the secondproduction details for the third manufactured item against the shippinginformation to determine whether unique production details among thesecond production details of the third manufactured item are within theproduction range of manufactured items.
 4. The method of claim 3,further comprising: receiving, over the communication network, datarelated to the unit identifier of the third manufactured item; andstoring current location information contained in the received data inassociation with a specified container identifier in response toauthentication of the third manufactured item.
 5. The method of claim 4,further comprising: comparing previous location information for thethird manufactured item with the current location information toidentify a shipping route of the third manufactured item.
 6. The methodof claim 2, further comprising: adjusting, at the respective productionline via the at least one processor, a current time period during whichthe plurality of manufactured items are produced on the respectiveproduction line, wherein the current time period is adjusted based on arate at which the plurality of manufactured items are produced.
 7. Themethod of claim 2, wherein the first production details common to themanufactured items within the production range include at least one of aproduction location, a production date, a production time, or anycombination thereof.
 8. The method of claim 7, wherein the productionlocation includes at least one of a production center, a productionline, a code generator identifier, or any combination thereof.
 9. Themethod of claim 7, wherein the first production details common to themanufactured items within the production range include a code generatoridentifier.
 10. The method of claim 2, wherein the production rangeidentifies manufactured items produced on the respective production lineduring a specified period.
 11. The method of claim 2, furthercomprising: packing the manufactured items in the container such thatthe manufactured items having consecutive unit identifiers are notstored consecutively.
 12. The method of claim 11, further comprising:mixing the manufactured items prior to being packed in the container.13. The method of claim 11, further comprising: removing, prior to thepacking, at least one manufactured item from among the manufactureditems within the production range of manufactured items.
 14. The methodof claim 2, further comprising: generating, by the at least oneprocessor, the plurality of container identifiers.
 15. A system forfacilitating authentication of manufactured items allocated tocontainers for shipping, each of the containers for shipping beingassigned a container identifier from among a plurality of containeridentifiers, and each container identifier being a first code, thesystem comprising: one or more production lines configured to producemanufactured items and prepare the manufactured items for shipment in atleast one of the containers; at least one processor connected to amemory device, the at least one processor configured to generate aplurality of unit identifiers, each of the plurality of unit identifiersbeing a second code that (i) corresponds to a respective manufactureditem among a plurality of manufactured items produced on a respectiveproduction line during a respective time period, and (ii) is anencrypted version of first production details associated with therespective manufactured item, the first production details including aproduction information code and a counter value, the counter valueindicative of a production run of the respective production line,wherein the second code corresponding to the respective manufactureditem is generated by combining the production information code and thecounter value to obtain an item identifier for the respectivemanufactured item, combining the item identifier with a noise code toobtain a resulting code, the noise code being based on a dynamic secretcode and a static code matrix, and obfuscating the resulting code toobtain the second code corresponding to the respective manufactureditem, store shipping information in the memory device, the shippinginformation being linked with a production range of manufactured itemsstored in a container, and the shipping information including (i) thefirst code for the container, (ii) first production details common tomanufactured items within the production range of manufactured items,and (iii) unique production details from among the first productiondetails associated with first and second manufactured items within theproduction range of manufactured items, wherein the shipping informationis linked with the production range of manufactured items using only theunique production details from among the first production detailsassociated with the first and second manufactured items, the productionrange of manufactured items includes manufactured items havingnon-sequential first production details; at least one marking deviceconfigured to mark each manufactured item with a corresponding one ofthe plurality of unit identifiers; wherein a memory requirement forstoring the shipping information is smaller than a memory requirementbased on storing the first code of the container and the second code foreach manufactured item stored in the container.
 16. The system of claim15, wherein the at least one processor is configured to adjust, at therespective production line, a current time period during which theplurality of manufactured items are produced on the respectiveproduction line, and the current time period is adjusted based on a rateat which the plurality of manufactured items are produced.
 17. Thesystem of claim 15, wherein the at least one processor is configured toreceive second production details for a third manufactured item storedin a remote container, the second production details for the thirdmanufactured item extracted from a unit identifier of the thirdmanufactured item, and authenticate the third manufactured item bycomparing the second production details for the third manufactured itemagainst the shipping information to determine whether unique productiondetails among the second production details of the third manufactureditem are within the production range of manufactured items.
 18. Thesystem according to claim 17, wherein the at least one processor isconfigured to receive data related to the unit identifier of the thirdmanufactured item; and store current location information contained inthe received data in association with a specified container identifierin response to authentication of the third manufactured item.
 19. Thesystem according to claim 18, wherein the at least one processor isconfigured to compare previous location information for the thirdmanufactured item with the current location information to identify ashipping route of the third manufactured item.
 20. The system accordingto claim 15, wherein the first production details common to themanufactured items within the production range include at least one of aproduction location, a production date, a production time, or anycombination thereof.
 21. The system according to claim 20, wherein theproduction location includes at least one of a production center, aproduction line, a code generator identifier, or any combinationthereof.
 22. The system of claim 15, wherein the at least one processoris configured to generate the plurality of container identifiers. 23.The system of claim 15, wherein the manufactured items are packed in thecontainer such that the manufactured items having consecutive unitidentifiers are not stored consecutively.
 24. A system for facilitatingauthentication of manufactured items allocated to at least one of aplurality of containers for shipping, each of the plurality ofcontainers for shipping being assigned a container identifier from amonga plurality of container identifiers, and each container identifierbeing a first code, the system comprising: at least one processorconnected to a memory device, the at least one processor configured togenerate a plurality of unit identifiers, each of the plurality of unitidentifiers being a second code that (i) corresponds to a respectivemanufactured item among a plurality of manufactured items produced on arespective production line during a respective time period, and (ii) isan encrypted version of first production details associated with therespective manufactured item, the first production details including aproduction information code and a counter value, the counter valueindicative of a production run of the respective production line,wherein the second code corresponding to the respective manufactureditem is generated by combining the production information code and thecounter value to obtain an item identifier for the respectivemanufactured item, combining the item identifier with a noise code toobtain a resulting code, the noise code being based on a dynamic secretcode and a static code matrix, and obfuscating the resulting code toobtain the second code corresponding to the respective manufactureditem, store shipping information in the memory device, the shippinginformation being linked with a production range of manufactured itemsstored in a container, and the shipping information including (i) thefirst code for the container, (ii) first production details common tomanufactured items within the production range of manufactured items,and (iii) unique production details from among the first productiondetails associated with first and second manufactured items within theproduction range of manufactured items, wherein the shipping informationis linked with the production range of manufactured items using only theunique production details from among the first production detailsassociated with the first and second manufactured items, the productionrange of manufactured items includes manufactured items havingnon-sequential first production details; at least one marking deviceconfigured to mark each manufactured item with a corresponding one ofthe plurality of unit identifiers; wherein a memory requirement forstoring the shipping information is smaller than a memory requirementbased on storing the first code of the container and the second code foreach manufactured item stored in the container.
 25. The system of claim24, wherein the manufactured items are packed in the container such thatthe manufactured items having consecutive unit identifiers are notstored consecutively.